Augmented Lagrangian methods with smooth penalty functions
نویسندگان
چکیده
Since the late 1990s, the interest in augmented Lagrangian methods has been revived, and several models with smooth penalty functions for programs with inequality constraints have been proposed, tested and used in a variety of applications. Global convergence results for some of these methods have been published. Here we present a local convergence analysis for a large class of smooth augmented Lagrangian methods based on spectral penalty functions. Our analysis shows that linear convergence in the neighborhood of a local minimum may be expected. Similar to the case of the Hestenes-Powell-Rockafellar augmented Lagrangian, this may be achieved without driving the penalty parameter to zero.
منابع مشابه
Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
We consider nonlinear optimization programs with matrix inequality constraints, also known as nonlinear semidefinite programs. We prove local convergence for an augmented Lagrangian method which uses smooth spectral penalty functions. The sufficient second-order no-gap optimality condition and a suitable implicit function theorem are used to prove local linear convergence without the need to dr...
متن کاملStochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions
We present a stochastic approximation algorithm based on penalty function method and a simultaneous perturbation gradient estimate for solving stochastic optimization problems with general inequality constraints. We present a general convergence result that applies to a class of penalty functions including the quadratic penalty function, the augmented Lagrangian, and the absolute penalty functi...
متن کاملStochastic optimisation with inequality constraints using simultaneous perturbations and penalty functions
We present a stochastic approximation algorithm based on penalty function method and a simultaneous perturbation gradient estimate for solving stochastic optimisation problems with general inequality constraints. We present a general convergence result that applies to a class of penalty functions including the quadratic penalty function, the augmented Lagrangian, and the absolute penalty functi...
متن کاملTHE EFFECTS OF INITIAL SAMPLING AND PENALTY FUNCTIONS IN OPTIMAL DESIGN OF TRUSSES USING METAHEURISTIC ALGORITHMS
Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...
متن کاملOn a Hyperbolic Augmented Lagrangian Artificial Fish Swarm Based Method: Convergence Issues
where f : Rn → R and g : Rn → Rp are nonlinear continuous functions and Ω = {x ∈ Rn : −∞ < l ≤ x ≤ u < ∞}. Problems with equality constraints, h(x) = 0, can be reformulated into the above form by converting into a couple of inequality constraints h(x)− β ≤ 0 and −h(x)− β ≤ 0, where β is a small positive relaxation parameter. Since we do not assume that the objective function f is convex, the pr...
متن کامل